On Some Optimization Problems in Obnoxious Facility Location
نویسندگان
چکیده
In this paper we study the following general MaxMinoptimization problem concerning undesirable (obnoxious) facility location: Given a set of n sites S inside a convex region P , construct m garbage deposit sites Vm such that the minimum distance between these sites Vm and the union of S and Vm, Vm∪S, is maximized. We present a general method using Voronoi diagrams to approximately solve two such problems when the sites S’s are points and weighted convex polygons (correspondingly, Vm’s are points and weighted points and the distances are L2 and weighted respectively). In the latter case we generalize the Voronoi diagrams for disjoint weighted convex polygons in the plane. Our algorithms run in polynomial time and approximate the optimal solutions of the above two problems by a factor of 2.
منابع مشابه
Improved Multi-objective PSO for Semi-desirable Facility Location Problem
Evolutionary optimization algorithms have been used to solve multiple objective problems. However, most of these methods have focused on search a sufficient Pareto front, and no efforts are made to explore the diverse Pareto optimal solutions corresponding to a Pareto front. Note that in semi-obnoxious facility location problems, diversifying Pareto optimal solutions is important. The paper the...
متن کاملGeometric branch-and-bound methods for constrained global optimization problems
Geometric branch-and-bound methods are popular solution algorithms in deterministic global optimization to solve problems in small dimensions. The aim of this paper is to formulate a geometric branch-and-bound method for constrained global optimization problems which allows the use of arbitrary bounding operations. In particular, our main goal is to prove the convergence of the suggested method...
متن کاملSolving single facility goal Weber location problem using stochastic optimization methods
Location theory is one of the most important topics in optimization and operations research. In location problems, the goal is to find the location of one or more facilities in a way such that some criteria such as transportation costs, customer traveling distance, total service time, and cost of servicing are optimized. In this paper, we investigate the goal Weber location problem in which the...
متن کاملSingle Facility Goal Location Problems with Symmetric and Asymmetric Penalty Functions
Location theory is an interstice field of optimization and operations research. In the classic location models, the goal is finding the location of one or more facilities such that some criteria such as transportation cost, the sum of distances passed by clients, total service time, and cost of servicing are minimized. The goal Weber location problem is a special case of location mode...
متن کاملA fuzzy capacitated facility location-network design model: A hybrid firefly and invasive weed optimization (FIWO) solution
Facility location-network design (FLND) problem, which determines the location of facilities and also communication links between the demand and facility nodes, is arisen from the combination of the facility location and network design problems. This paper deals with fuzzy capacitated facility location-network design model which aims to select the facilities and candidate links in a way that yi...
متن کامل